COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	%autoep[w88,jmc]		Reifying propositions in autoepistemic logic
C00003 ENDMK
C⊗;
%autoep[w88,jmc]		Reifying propositions in autoepistemic logic

Perhaps the nonmonotonic reasoning in autoepistemic logic is doable
by circumscription or default reasoning if the operator $L$ is
made into an ordinary function operating on propositions.  We will
also reify extensions.  We have

$$holds(p,e) ⊃ holds(L\ p,e)$$
%
and
%
$$¬holds(p,e) ⊃ holds(not\ L\ p,e)$$
%
as the special autoepistemic axioms in addition to the usual axioms
required when propositions are reified.  It looks like we have to
formalize the consequence relation.  Do we also need sets of propositions
as objects?